Heuristic Algorithm of Allocation of WavelengthConvertible Nodes and Routing Coordination inAll - Optical

100 Heuristic Algorithm of Allocation of Wavelength Convertible Nodes and Routing Coordination in All-Optical Networks Hiroaki Harai, Masayuki Murata and Hideo Miyahara Department of Informatics and Mathematical Science Graduate School of Engineering Science, Osaka University Toyonaka, Osaka 560-8531, Japan Abstract| It is true that in all-optical networks, network performance can be improved by wavelength conversion. However, the switching node with wavelength conversion capability is still costly, and the number of such nodes should be limited in the network. In this paper, a performance optimization problem is treated in all-optical networks. We propose a heuristic algorithm to minimize an overall blocking probability by properly allocating a limited number of nodes with wavelength conversion capability. The routing strategy is also considered suitable to the case where the number of wavelength convertible nodes are limited. We validate the minimization level of our heuristic algorithm through numerical examples, and show that our algorithm can properly allocate nodes with conversion and decide routes for performance optimization. Keywords|wavelength conversion, blocking minimization problem, heuristic, ADD algorithm, Descent algorithm, approximation analysis